Scheduling Online Advertisements Using Information Retrieval and Neural Network/genetic Algorithm Based Metaheuristics
نویسنده
چکیده
This document is dedicated to my entire family, but especially to Amanda, Conner, mom and pawpaw. Amanda and Conner provided me with the necessary strength, determination and never ending support and were my inspiration in pursuing and finishing my PhD. Mom and pawpaw are, without a doubt, the two most influential people in my life. For good and for bad, everything that I am is as a result of my never ending effort to model myself after these two amazing people. Pawpaw was the kindest and most sincere person that I have ever met and although he's in a better place now, I still think of him every day. My mother is the strongest and hardest working person that I know and without her many sacrifices, my life could have been completely different and I would never have had the opportunity to achieve this goal. Thank you! iv ACKNOWLEDGMENTS I would like to especially thank my wife Amanda for supporting and putting up with me throughout this process. I know that it was not easy. I would also like to thank our families for their never ending support throughout this very challenging endeavor. In addition, I would like to thank my dissertation committee and the DIS department staff for their support and guidance. In particular I would like to thank and acknowledge my advisor, Anurag Agarwal, and my co-chair, Praveen Pathak, for their countless hours of training and support. I couldn't have done it without you!! v TABLE OF CONTENTS
منابع مشابه
Investigating Financial Crisis Prediction Power using Neural Network and Non-Linear Genetic Algorithm
Bankruptcy is an event with strong impacts on management, shareholders, employees, creditors, customers and other stakeholders, so as bankruptcy challenges the country both socially and economically. Therefore, correct prediction of bankruptcy is of high importance in the financial world. This research intends to investigate financial crisis prediction power using models based on Neural Network...
متن کاملSolving the flexible job shop problem by hybrid metaheuristics-based multiagent model
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...
متن کاملA New Method for Intrusion Detection Using Genetic Algorithm and Neural Network
The article attempts to have neural network and genetic algorithm techniques present a model for classification on dataset. The goal is design model can the subject acted a firewall in network and this model with compound optimized algorithms create reliability and accuracy and reduce error rate couse of this is article use feedback neural network and compared to previous methods increase a...
متن کاملModeling and scheduling no-idle hybrid flow shop problems
Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...
متن کاملThe hybrid approach based on genetic algorithm and neural network to predict financial fraud in banks
Audit has become an essential topic in the world because there is much evidence about deliberate manipulations in the reports. One of the concerns in the field of audit is discovery and search of the financial statements and the high volume of bulk data. This study tried to suggest the appropriate method to detect these frauds due to the data which has been available and a proposed algorithm. R...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006